Inference in probabilistic logic programs with continuous random variables

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inference in probabilistic logic programs with continuous random variables

Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya’s PRISM, Poole’s ICL, Raedt et al’s ProbLog and Vennekens et al’s LPAD, is aimed at combining statistical and logical knowledge representation and inference. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use ...

متن کامل

Inference and Learning in Probabilistic Logic Programs with Continuous Random Variables

of the Dissertation Inference and Learning in Probabilistic Logic Programs with Continuous Random Variables

متن کامل

Symbolic Probabilistic Inference with Continuous Variables

Research on Symbolic Probabilistic Inference (SPI) [2, 3) has provided an algorithm for re­ solving general queries in Bayesian networks. SPI applies the concept of dependency­ directed backward search to probabilistic in­ ference, and is incremental with respect to both queries and observations. Unlike tra­ ditional Bayesian network inferencing algo­ rithms, SPI algorithm is goal directed, per...

متن کامل

Constraint-Based Inference in Probabilistic Logic Programs

A wide variety of models that combine logical and statistical knowledge can be expressed succinctly in the Probabilistic Logic Programming (PLP) paradigm. Specifically, models in standard statistical formalisms such as probabilistic graphical models (PGMs) (e.g. Bayesian Networks), can be easily encoded as PLP programs. For instance, Fig. 1(a) shows a program in PRISM, a pioneering PLP language...

متن کامل

Abductive Inference in Probabilistic Logic Programs

Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behaviors of entities. Rules in ap-programs have the form “If the environment in which entity E operates satisfies certain conditions, then the probability that E will take some action A is between L and U”. Given an ap-program, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2012

ISSN: 1471-0684,1475-3081

DOI: 10.1017/s1471068412000154